Douglas–Rachford Feasibility Methods for Matrix Completion Problems
نویسندگان
چکیده
In this paper we give general recommendations for successful application of the Douglas–Rachford reflection method to convex and non-convex real matrix-completion problems. These guidelines are demonstrated by various illustrative examples.
منابع مشابه
Theory and Applications of Convex and Non-convex Feasibility Problems
Let X be a Hilbert space and let Cn, n = 1, . . . ,N be convex closed subsets of X . The convex feasibility problem is to find some point x ∈ N ⋂ n=1 Cn, when this intersection is non-empty. In this talk we discuss projection algorithms for finding such a feasibility point. These algorithms have wide ranging applications including: solutions to convex inequalities, minimization of convex nonsmo...
متن کاملReflection methods for inverse problems with applications to protein conformation determination
The Douglas–Rachford reflection method is a general purpose algorithm useful for solving the feasibility problem of finding a point in the intersection of finitely many sets. In this chapter we demonstrate that applied to a specific problem, the method can benefit from heuristics specific to said problem which exploit its special structure. In particular, we focus on the problem of protein conf...
متن کاملRecent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems
We discuss recent positive experiences applying convex feasibility algorithms of Douglas–Rachford type to highly combinatorial and far from convex problems.
متن کاملRecent Results on Douglas–rachford Methods
Recent positive experiences applying convex feasibility algorithms of Douglas–Rachford type to highly combinatorial and far from convex problems are described.
متن کاملA Cyclic Douglas-Rachford Iteration Scheme
In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013